Solution of an integer programming problem related to convergence of rows of Pad& approximants
نویسندگان
چکیده
Kaminski, M. and A. Sidi, Solution of an integer programming problem related to convergence of rows of PadC approximants, Applied Numerical Mathematics 8 (1991) 217-223. The following integer programming problem arises in the convergence analysis of rows of Pade approximants for meromorphic functions: maximize Xr=r( C+J, C-I,‘), subject to the constraints C:=ro, = 7, 0 < a, < w,, 1 Q i Q r. Here the w, and r are given positive integers, and the u, are the integer unknowns. An algorithm is developed, by which all possible solutions can be constructed, and conditions for uniqueness are provided. Examples are appended.
منابع مشابه
Intermediate Rows of the Walsh Array of Best Rational Approximants to Meromorphic Functions
We investigate the convergence of the rows (fixed denominator degree) of the Walsh array of best rational approximants to a meromorphic function. We give an explicit algorithm for determining when convergence is guaranteed and obtain rates of convergence.in the appropriate cases. This algorithm also provides the solution to an integer programming problem that arises in the study of Pade approxi...
متن کاملQuantitative and constructive aspects of the generalized Koenig’s and de Montessus’s theorems for Pad6 approximants *
Abstract: The generalized Koenig’s theorem and de Montessus’s theorem are two classical results concerning the convergence of the rows of the Pad& table for meromorphic functions. Employing a technique that was recently developed for the analysis of vector extrapolation methods, refined versions of these theorems are proved in the present work. Specifically, complete expansions for the numerato...
متن کاملComparison of acceleration techniques of analytical methods for solving differential equations of integer and fractional order
The work addressed in this paper is a comparative study between convergence of the acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method and Adomian decomposition method for solving differential equations of integer and fractional orders.
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کامل